Logic program synthesis from incomplete specifications

Logic Program Synthesis from Incomplete Specifications

Program synthesis research aims at maximally automating the passage from specifications to programs (see the survey by Biermann, 1992). We define possible formalisms for the starting points (specifications: see Section 1.1) and results (programs: see Section 1.2) of synthesis, and state existing approaches and related work, before pinning down the objectives (Section 1.3) of this paper. Some fa...

SYNAPSE- A System for Logic Program Synthesis from Incomplete Specifications

A logic program development methodology has been proposed by the second author [3]. It aims at programming-in-the-small, and is (mainly) meant for “algorithmic” problems. It starts from a complete, yet informal, specification of the target problem. A crucial step is the design of the logic of the program, based solely on the declarative semantics of logic, and with exclusive concern about corre...

Iterative Induction of Logic Programs, An approach to logic program synthesis from incomplete specifications

Automation of Program Synthesis from Logic-Based Specifications

Introduction In [Manna and Waldinger, 1992] the deductive tableau method was proposed. It is appropriate for the synthesis of functional programs. The specification of a program is taken as a mathematical existence theorem and we prove the existence of an object that satisfies the specified conditions. Specification is based on predicate-logic, because it is quite general and appropriate for de...

Program Synthesis for Hierarchical Specifications

Synthesis is the problem of obtaining programs from relational specifications. We present grammar-modular (GM) synthesis, an algorithm for synthesis from tree-structured relational specifications. GM synthesis makes synthesis applicable to previously intractable relational specifications by decomposing them into smaller subproblems, which can be tackled in isolation by off-the-shelf synthesis p...